Theoretical and computational study of several linearisation techniques for binary quadratic problems
نویسندگان
چکیده
منابع مشابه
the study of practical and theoretical foundation of credit risk and its coverage
پس از بررسی هر کدام از فاکتورهای نوع صنعت, نوع ضمانت نامه, نرخ بهره , نرخ تورم, ریسک اعتباری کشورها, کارمزد, ریکاوری, gdp, پوشش و وثیقه بر ریسک اعتباری صندوق ضمانت صادرات ایران مشخص گردید که همه فاکتورها به استثنای ریسک اعتباری کشورها و کارمزد بقیه فاکتورها رابطه معناداری با ریسک اعتباری دارند در ضمن نرخ بهره , نرخ تورم, ریکاوری, و نوع صنعت و ریسک کشورها اثر عکس روی ریسک اعتباری داردو پوشش, وثی...
15 صفحه اولSeveral versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems
The unconstrained binary quadratic optimization problem (UQP) is known to be NP-hard and due to its computational challenge and application potential, it becomes more and more considered and involved by the recent research studies, including both exact and heuristic solution approaches. Our work is in line with that of Glover, Alidaee, Rego and Kochenberger (2002) who proposed one pass heuristi...
متن کاملGraphcuts for General Quadratic Binary Problems
We propose a novel approach to optimizing unconstrained quadratic binary problems (QBP) and binary MRFs based on discrete, submodular majorization of the original problem that can be solved efficiently using graph cuts. This yields an efficient algorithm that is appropriate for quickly finding a good solution to general Quadratic Binary Problems. It first solves a majorizing function exactly to...
متن کاملCompact linearization for binary quadratic problems
We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer problems subject to assignment constraints. The resulting linearized formulation is more compact and tighter than that obtained with a more usual linearization technique. We discuss the application of the compact linearizatio...
متن کاملExtended Linear Formulation for Binary Quadratic Problems
We propose and test a new linearisation technique for the Binary Quadratic Problems (BQPs). We computationally prove that the new formulation, called Extended Linear Formulation, can be effective for different classes of problems in practice. Our tests are based on two sets of classical BQPs from the literature, i.e., the Unconstrained BQP and the Maximum Cut of edge-weighted graphs. Finally we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2018
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-018-3118-2